Nonstandard Graphs, Revised
نویسنده
چکیده
This is a revision of the paper archived previously on August 22, 2002. It corrects a mistake in Sec. 8 concerning eccentricities of graphs. From any given sequence of finite or infinite graphs, a nonstandard graph is constructed. The procedure is similar to an ultrapower construction of an internal set from a sequence of subsets of the real line, but now the individual entities are the vertices of the graphs instead of real numbers. The transfer principle is then invoked to extend several graph-theoretic results to the nonstandard case. After incidences and adjacencies between nonstandard vertices and edges are defined, several formulas regarding numbers of vertices and edges, and nonstandard versions of Eulerian graphs, Hamiltonian graphs, and a coloring theorem are established for these nonstandard graphs.
منابع مشابه
Ends of groups: a nonstandard perspective
We give a nonstandard treatment of the notion of ends of proper geodesic metric spaces. We then apply this nonstandard treatment to Cayley graphs of finitely generated groups and give nonstandard proofs of many of the fundamental results concerning ends of groups. We end with an analogous nonstandard treatment of the ends of relatively Cayley graphs, that is Cayley graphs of cosets of finitely ...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کاملNonstandard Transfinite Graphs and Networks of Higher Ranks
In Chapter 8 of the book, “Graphs and Networks: Transfinite and Nonstandard,” (published by Birkhauser-Boston in 2004), nonstandard versions of transfinite graphs and of electrical networks having such graphs were defined and examined but only for the first two ranks, 0 and 1, of transfiniteness. In the present work, these results are extended to higher ranks of transfiniteness. Such is done in...
متن کاملNonstandard Analysis of Graphs
Intuitively, it is tempting to view a cube in R as a discrete lattice with infinitesimal edges. A similar infinitesimal picture suggests itself with other fractal spaces such as the Sierpinski gasket or the Sierpinski sponge (see [13], [5].) The purpose of this paper is to show certain classes of metric spaces characterized by volume growth properties of balls ([4],[2]) can viewed as graphs wit...
متن کاملNonstandard Picture of Turbulence (The Second Revised)
The nonstandard picture of a turbulent field is presented in the article. By the concepts of nonstandard mathematics, the picture describes the hierarchical structure of turbulence and shows the mechanism of fluctuation appearing in a turbulent field. The uncertainty of measurement is pointed out. And the fundamental equations of turbulence are given too. It is natural in this picture that the ...
متن کامل